Imbalance in tournament designs
نویسندگان
چکیده
We introduce two measures of imbalance, the team imbalance, and the field imbalance, in a tournament design. In addition to an exhaustive study of imbalances in tournament designs with up to eight teams, we present some bounds on the imbalances, as well as recursive constructions for homogeneous tournaments.
منابع مشابه
Generalized whist tournament designs
In this study a new class of tournament designs is introduced. In particular, each game of the tournament involves several (two or more) teams competing against one another. The tournament is also required to satisfy certain balance conditions that are imposed on each pair of players. These balance conditions are related to both the total number of players on each team and the number of teams i...
متن کاملThe Optimal Design of Sporting Contests
The idea that Operational Research can be used to optimise the design of a sporting contest or tournament is a novel one. This paper considers a methodology for this purpose. We propose a number of tournament metrics that can be used to measure the success of a sporting contest or tournament, and describe how these metrics may be evaluated for a particular tournament design. Knowledge of these ...
متن کاملSplittable Triplewhist Tournament Designs
We show that Z-cyclic splittable triplewhist tournament designs exist for all primes of the form p = 8t + 1, t odd, except possibly p = 41.
متن کاملEqual Sum Sequences and Imbalance Sets of Tournaments
Reid conjectured that any finite set of non-negative integers is the score set of some tournament and Yao gave a non-constructive proof of Reid’s conjecture using arithmetic arguments. No constructive proof has been found since. In this paper, we investigate a related problem, namely, which sets of integers are imbalance sets of tournaments. We completely solve the tournament imbalance set prob...
متن کاملThe Existence of Near Generalized Balanced Tournament Designs
In this paper, we complete the existence of near generalized balanced tournament designs (NGBTDs) with block size 3 and 5. As an application, we obtain new classes of optimal constant composition codes.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 23 شماره
صفحات -
تاریخ انتشار 2001